Exchangeable Markov multi-state survival processes
نویسندگان
چکیده
منابع مشابه
Exchangeable Markov Processes on Graphs: Feller Case
The transition law of every exchangeable Feller process on the space of countable graphs is determined by a σ-finite measure on the space of {0, 1} × {0, 1}-valued arrays. In discrete-time, this characterization amounts to a construction from an independent, identically distributed sequence of exchangeable random functions. In continuous-time, the behavior is enriched by a Lévy–Itô-type decompo...
متن کاملEXCHANGEABLE MARKOV PROCESSES ON [k]N WITH CADLAG SAMPLE PATHS
Any exchangeable, time-homogeneous Markov processes on [k] with cadlag sample paths projects to a Markov process on the simplex whose sample paths are cadlag and of locally bounded variation. Furthermore, any such process has a de Finetti-type description as a mixture of independent, identically distributed copies of time-inhomogeneous Markov processes on [k]. In the Feller case, these time-inh...
متن کاملOn Finite Markov Exchangeable Sequences
We show that a finite Markov exchangeable sequence of random variables with finite state space is a signed mixture of Markov chains. This is shown to partially generalize earlier work by Fortini et al. and Freedman under the added condition of stationarity. Associated statistical issues are discussed and a test of Markov exchangeability is proposed.
متن کاملNeyman, Markov processes and survival analysis.
J. Neyman used stochastic processes extensively in his applied work. One example is the Fix and Neyman (F-N) competing risks model (1951) that uses finite homogeneous Markov processes to analyse clinical trials with breast cancer patients. We revisit the F-N model, and compare it with the Kaplan-Meier (K-M) formulation for right censored data. The comparison offers a way to generalize the K-M f...
متن کاملDenumerable State Nonhomogeneous Markov Decision Processes
We consider denumerable state nonhomogeneous Markov decision processes and extend results from both denumerable state homogeneous and finite state nonhomogeneous problems. We show that, under weak ergodicity, accumulation points of finite horizon optima (termed algorithmic optima) are average cost optimal. We also establish the existence of solution horizons. Finally, an algorithm is presented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistica Sinica
سال: 2021
ISSN: 1017-0405
DOI: 10.5705/ss.202018.0403